Linear control of live marked graphs

Marked Directed Graphs

Morphisms on Marked Graphs

Abstract. Many kinds of morphisms on Petri nets have been defined and studied. They can be used as formal techniques supporting refinement/abstraction of models. In this paper we introduce a new notion of morphism on marked graphs, a class of Petri nets used for the representation of systems having deterministic behavior. Such morphisms can indeed be used to represent a form of abstraction on m...

Characterizations of Consistent Marked Graphs

A marked graph is a graph with a + or − sign on each vertex and is called consistent if each cycle has an even number of − signs. This concept is motivated by problems of communication networks and social networks. We present some new characterizations/recognition algorithms for consistent marked graphs.

Determinate STG Decomposition of Marked Graphs

STGs give a formalism for the description of asynchronous circuits based on Petri nets. To overcome the state explosion problem one may encounter during circuit synthesis, a nondeterministic algorithm for decomposing STGs was suggested by Chu and improved by one of the present authors. To find the best possible result the algorithm might produce, it would be important to know to what extent non...

Marking Optimization and Parallelism of Marked Graphs

The aim of the paper is to provide a formalization of the notion of parallelism of a marked graph exploitable by parallel simulation. We show that there exists an optimal starting point for equational simulations which gives a speed of simulation in the order of the intrinsic sequentiality of the system. Furthermore, under few assumptions, the modiication of the marking will accelerate the simu...